Spanner Graph based Topology Aggregation Schemes for Large Networks

In this paper we propose schemes for topology aggregation in large networks. Topology aggregation is needed due to two main reasons. First, it is not possible to advertise the full topology information of a network due to the excessive complexity involved. Secondly, it may be required to keep the internal topology hidden for security reasons. The main issue in topology aggregation is, given a network, how one can represent it by a compact network and still capture the best possible parameter values for routing purposes. We present spanner graph based schemes for aggregating propagation delays and link bandwidths in this paper. We study the performance of our schemes through simulations. The performance indices are false call acceptance and false call blocking. The proposed schemes achieve better aggregation than the full mesh method and better accuracy than the default representation.